- polyadic relation
- мат.многоместное [многочленное] отношение
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Triadic relation — In logic and mathematics, a triadic relation or a ternary relation is an important special case of a polyadic or finitary relation, one in which the number of places in the relation is three. One also sees the adjectives 3 adic , 3 ary , 3 dim ,… … Wikipedia
Theory of relations — This article is about the theory of relations with regard to its specifically combinatorial aspects. For a general discussion of the basic definitions, see Binary relation and Finitary relation. The theory of relations treats the subject matter… … Wikipedia
Pi-calculus — In theoretical computer science, the pi calculus is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems). The aim of the … Wikipedia
π-calculus — In theoretical computer science, the π calculus (or pi calculus) is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems) … Wikipedia
Lindström quantifier — In mathematical logic, a Lindström quantifier is a generalized polyadic quantifier. They are a generalization of first order quantifiers, such as the existential quantifier, the universal quantifier, and the counting quantifiers.They were… … Wikipedia
Arity — In logic, mathematics, and computer science, the arity i/ˈær … Wikipedia
Quasigroup — In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling a group in the sense that division is always possible. Quasigroups differ from groups mainly in that they need not be associative. A quasigroup with … Wikipedia
Monadic predicate calculus — In logic, the monadic predicate calculus is the fragment of predicate calculus in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters. All atomic formulae have the form P(x), where P… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Semiotic elements and classes of signs — C. S. Peirce articles General: Charles Sanders Peirce Charles Sanders Peirce bibliography Philosophical: Categories (Peirce) Semiotic elements and classes of signs (Peirce) Pragmatic maxim • Pragmaticism… … Wikipedia
List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia